Online algorithms

Results: 217



#Item
21Competitive Online Algorithms Susanne Albers Overview  arrive one by one and must be scheduled immediately

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:09:17
22Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract  The best randomized

Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:04
23Deconstructing Online Algorithms Ike Antkaretoo International Institute of Technology United Slates of Earth  A BSTRACT

Deconstructing Online Algorithms Ike Antkaretoo International Institute of Technology United Slates of Earth A BSTRACT

Add to Reading List

Source URL: membres-lig.imag.fr

Language: English - Date: 2014-01-09 04:24:29
24Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS  Jan Bul´anek

Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS Jan Bul´anek

Add to Reading List

Source URL: iuuk.mff.cuni.cz

Language: English - Date: 2014-07-29 07:02:19
25Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:02
26CS264: Beyond Worst-Case Analysis Lecture #3: Online Paging and Resource Augmentation∗ Tim Roughgarden† September 29,

CS264: Beyond Worst-Case Analysis Lecture #3: Online Paging and Resource Augmentation∗ Tim Roughgarden† September 29,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-10-06 12:17:28
27Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:00
28What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw

What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw

Add to Reading List

Source URL: www.optimization-online.org

Language: English - Date: 2015-05-04 12:28:03
29Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 3 Problem 1 Algorithm: for the simplicity let’s assume that n = 2k, algorithm can be easily modified if n = 2k + 1 by using one additional comparison

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-02 15:13:55
30Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness Submission to GECCO Track “Evolutionary Multiobjective Optimization (EMO)” ABSTRACT We study the convergence behavior of (µ + λ)-archiving a

Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness Submission to GECCO Track “Evolutionary Multiobjective Optimization (EMO)” ABSTRACT We study the convergence behavior of (µ + λ)-archiving a

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:34